Parameterization of Triangular Meshes with Virtual Boundaries

نویسندگان

  • Yunjin Lee
  • Hyoung Seok Kim
  • Seungyong Lee
چکیده

Parameterization of a 3D triangular mesh is a fundamental problem in mesh processing, such as texture mapping, multiresolution modeling, and smooth surface fitting. The convex combination approach is widely used for parameterization because it has good properties such as fast computation and little distortion of embedded triangles. However, the approach has one drawback: most boundary triangles have high distortion in the embedding compared with interior ones. In this paper, we present an extension of the convex combination approach that resolves the drawback by using a virtual boundary. We construct a virtual boundary near the real boundary of the 3D mesh and fix the virtual boundary onto a given convex polygon. Due to the virtual boundary, the real boundary triangles can better reflect the shape of the corresponding 3D triangles. We also make the shape of the 2D boundary closer to that of the original 3D meshes by projecting the 3D boundary onto an appropriate 2D plane and obtaining its convex hull. With the proposed approach, we can obtain a parameterization of a 3D mesh with less distortion than with the original convex combination approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameterization of Quadrilateral Meshes

Low-distortion parameterization of 3D meshes is a fundamental problem in computer graphics. Several widely used approaches have been presented for triangular meshes. But no direct parameterization techniques are available for quadrilateral meshes yet. In this paper, we present a parameterization technique for non-closed quadrilateral meshes based on mesh simplification. The parameterization is ...

متن کامل

One-Forms on Meshes and Applications to 3D Mesh Parameterization

We develop a theory of one-forms on meshes. The theory culminates in a discrete analog of the Poincare-Hopf index theorem for meshes. We apply this theorem to obtain some old and new results concerning the parameterization of 3D mesh data. Our first result is an easy proof of Tutte's celebrated "spring-embedding" theorem for planar graphs, which is widely used for parameterizing meshes with the...

متن کامل

Mesh parameterization with a virtual boundary

Parameterization of a 3D triangular mesh is a fundamental problem in various applications of meshes. The convex combination approach is widely used for parameterization because of its good properties, such as fast computation and one-to-one embedding. However, the approach has a drawback: most boundary triangles have high distortion in the embedding compared with interior ones. In this paper, w...

متن کامل

Parameterization Michael S . Floater

Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point cloud data. However, we often want a smoother surface representation, and hence the need arises to fit a smooth parametric surface through the vertices of the mesh. This requires making a suitable parameterization. Parameterizations are also useful ...

متن کامل

Discrete one-forms on meshes and applications to 3D mesh parameterization

We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an easy proof of Tutte’s celebrated “springembedding” theorem for planar graphs, which is widely used for parameterizing meshes with the topology of a disk as a planar embedding with a convex boundary. Our second result gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001